Anemone: Transparently Harnessing Cluster-Wide Memory

نویسندگان

  • Michael R. Hines
  • Mark Lewandowski
  • Jian Wang
  • Kartik Gopalan
چکیده

There is a constant battle to break even between continuing improvements in DRAM capacities and the growing memory demands of large-memory high-performance applications. Performance of such applications degrades quickly once the system hits the physical memory limit and starts swapping to the local disk. We present the design, implementation and evaluation of Anemone – an Adaptive Network Memory Engine – that virtualizes the collective unused memory of multiple machines across a gigabit Ethernet LAN, without requiring any modifications to the either the large memory applications or the Linux kernel. We have implemented a working prototype of Anemone and evaluated it using real-world unmodified applications such as ray-tracing and large in-memory sorting. Our results with the Anemone prototype show that unmodified single-process applications execute 2 to 3 times faster and multiple concurrent processes execute 6 to 7.7 times faster, when compared to disk based paging. The Anemone prototype reduces page-fault latencies by a factor of 19.6 – from an average of 9.8ms with disk based paging to 500μs with Anemone. Most importantly, Anemone provides a virtualized low-latency access to potentially “unlimited” network memory resources.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation Experiences in Transparently Harnessing Cluster-Wide Memory

There is a constant battle to break even between continuing improvements in DRAM capacities and the growing memory demands of large-memory high-performance applications. Performance of such applications degrades quickly once the system hits the physical memory limit and starts swapping to the local disk. In this paper, we investigate the benefits and tradeoffs in pooling together the collective...

متن کامل

Fast Transparent Cluster-Wide Paging

In a cluster with a very low-latency interconnect, the remote memory of nodes can serve as a storage that is faster than local disk but slower than local memory. In this paper, we address the problem of transparently utilizing this cluster-wide pool of unused memory as a low-latency paging device. Such a transparent remote memory paging system can enable large-memory applications to benefit fro...

متن کامل

Distributed Anemone: Transparent Low-Latency Access to Remote Memory

Performance of large memory applications degrades rapidly once the system hits the physical memory limit and starts paging to local disk. We present the design, implementation and evaluation of Distributed Anemone (Adaptive Network Memory Engine) – a lightweight and distributed system that pools together the collective memory resources of multiple machines across a gigabit Ethernet LAN. Anemone...

متن کامل

A New Distributed JVM for Cluster Computing

In this work, we introduce CoJVM, a new distributed Java run-time system that enables concurrent Java programs to efficiently execute on clusters of personal computers or workstations. CoJVM implements Java’s shared memory model by enabling multiple standard JVMs to work cooperatively and transparently to support a single distributed shared-memory across the cluster’s nodes. CoJVM requires no c...

متن کامل

Interfacing Wide-Area Network Computing and Cluster Management Software: Condor, DQS and PBS via PUNCH

Software: Condor, DQS and PBS via PUNCH Sumalatha Adabala Nirav H. Kapadia Jos e A. B. Fortes School of Electrical and Computer Engineering, Purdue University fadabala, kapadia, [email protected] Abstract This paper outlines the issues that must be addressed in order to allow cluster management systems such as Condor, DQS, and PBS to be transparently used via a wide-area network-computing syst...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006